Modal Analysis With Compressive Measurements
نویسندگان
چکیده
منابع مشابه
Atomic Norm Minimization for Modal Analysis from Compressive Measurements
One analytical technique for assessing the health of a structure such as a building or bridge is to estimate its mode shapes and frequencies via vibrational data collected from the structure. A change in a structure’s modal parameters could be indicative of damage. Due to the considerable time and expense required to perform manual inspections of physical structures, and the difficulty of repea...
متن کاملEfficient modal analysis using compressive optical interferometry.
Interferometry is routinely used for spectral or modal analysis of optical signals. By posing interferometric modal analysis as a sparse recovery problem, we show that compressive sampling helps exploit the sparsity of typical optical signals in modal space and reduces the number of required measurements. Instead of collecting evenly spaced interferometric samples at the Nyquist rate followed b...
متن کاملCompressive video sensing with limited measurements
Compressive sensing (CS) is an innovative technology, allowing us to capture signals with significantly fewer samples than those required by classical Nyquist theory. We propose a novel adaptive video compressive sensing algorithm to exploit the potential of CS in video acquisition. Each frame is divided into blocks to take advantage of its inhomogeneity. We first classify the blocks into one o...
متن کاملDetection and Estimation with Compressive Measurements
The recently introduced theory of compressed sensing enables the reconstruction of sparse or compressible signals from a small set of nonadaptive, linear measurements. If properly chosen, the number of measurements can be much smaller than the number of Nyquist rate samples. Interestingly, it has been shown that random projections are a satisfactory measurement scheme. This has inspired the des...
متن کاملWatermarking of Compressive Sensed Measurements
Compressive Sensing (CS) claims that a sparse signal can be reconstructed with far fewer random measurements with polynomial time algorithms using l1 minimization [1]. Channel decoding counterpart of the CS has been developed in [2] for linear decoding of a message from erroneous version under unbounded sparse noise. Sheikh and Baraniuk use this idea to embed watermark onto a sparse signal (e.g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2014
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2014.2302736